testing algorithm — алгоритм тестирования; алгоритм проверки
simulated annealing algorithm — алгоритм модельной "закалки"
multipoint algorithm — алгоритм решения многоточечной задачи
grid expansion algorithm — алгоритм распространения по сетке
fault-handling algorithm — алгоритм устранения неисправности
English-Russian big medical dictionary. 2005.
Event monitoring — In computer science, event monitoring is the process of collecting, analyzing, and signalling event occurrences to subscribers such as operating system processes, active database rules as well as human operators. These event occurrences may stem… … Wikipedia
Event condition action — (ECA) is a short cut for referring to the structure of active rules in event driven architecture and database systems. Such a rule did traditionally consist of three parts:* The event part specifies the signal that triggers the invocation of the… … Wikipedia
Automata-based programming (Shalyto's approach) — Automata Based Programming is a programming technology [1] . Its defining characteristic is the use of finite state machines to describe program behavior. The transition graphs of a state machines are used in all stages of software development… … Wikipedia
Agent-based model — An agent based model (ABM) (also sometimes related to the term multi agent system or multi agent simulation) is a class of computational models for simulating the actions and interactions of autonomous agents (both individual or collective… … Wikipedia
Knuth–Morris–Pratt algorithm — The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a word W within a main text string S by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to… … Wikipedia
Super-recursive algorithm — In computer science and computability theory, super recursive algorithms are algorithms that are more powerful, that is, compute more, than Turing machines. The term was introduced by Mark Burgin, whose book Super recursive algorithms develops… … Wikipedia
GSP Algorithm — ( Generalized Sequential Pattern algorithm) is an algorithm used for sequence mining. The algorithms for solving sequence mining problems are mostly based on the a priori (level wise) algorithm. One way to use the level wise paradigm is to first… … Wikipedia
TCP congestion avoidance algorithm — The TCP uses a network congestion avoidance algorithm that includes various aspects of an additive increase multiplicative decrease (AIMD) scheme, with other schemes such as slow start in order to achieve congestion avoidance. TCP Tahoe and Reno… … Wikipedia
Software choice for discrete event simulations — Tools for discrete event simulationsDiscrete event simulations may be written in any general purpose computer language such as C++ but to construct an industry grade project in reasonable time with a general computing language consumes too much… … Wikipedia
Automata-based programming — is a programming paradigm in which the program or its part is thought of as a model of a finite state machine or any other (often more complicated) formal automata (see automata theory). Sometimes a potentially infinite set of possible states is… … Wikipedia
Finite & Deterministic Discrete Event System Specification — FD DEVS (Finite Deterministic Discrete Event System Specification) is a formalism for modeling and analyzing discrete event dynamic systems in both simulation and verification ways. FD DEVS also provides modular and hierarchical modeling features … Wikipedia
